The Cut-Elimination Theorem for Differential Nets with Promotion
نویسنده
چکیده
Recently Ehrhard and Regnier have introduced Differential Linear Logic, DiLL for short — an extension of the Multiplicative Exponential fragment of Linear Logic that is able to express non-deterministic computations. The authors have examined the cut-elimination of the promotion-free fragment of DiLL by means of a proofnet-like calculus: differential interaction nets. We extend this analysis to exponential boxes and prove the Cut-Elimination Theorem for the whole DiLL: every differential net that is sequentializable can be reduced to a cut-free net.
منابع مشابه
Naming Proofs in Classical Propositional Logic
We present a theory of proof denotations in classical propositional logic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. With the Boolean semiring we get a theory of classical proof nets, with a geometric correctness criterion, a sequentialization theorem, and a strongly normalizing cut-elimination procedure. This gives us a “Boolean” cat...
متن کاملMELL in the calculus of structures
Gentzen’s sequent calculus is a tool to study properties of logics independently of semantics. The main property is cut-elimination which entails the subformula property and consistency. It is also the basis of methods of automated deduction. Although the sequent calculus is very appropriate for classical logic, it raises some concerns in dealing with more refined logics like linear logic. An e...
متن کاملConfluence of Pure Differential Nets with Promotion
We study the confluence of Ehrhard and Regnier’s differential nets with exponential promotion, in a pure setting. Confluence fails with promotion and codereliction in absence of associativity of (co)contractions. We thus introduce it as a necessary equivalence, together with other optional ones. We then prove that pure differential nets are Church-Rosser modulo such equivalences. This result ge...
متن کاملOn differential interaction nets and the pi-calculus
We propose a translation of a finitary (that is, replication-free) version of the pi-calculus into promotionfree differential interaction net structures, a linear logic version of the differential lambda-calculus (or, more precisely, of a resource lambda-calculus). For the sake of simplicity only, we restrict our attention to a monadic version of the pi-calculus, so that the differential intera...
متن کاملPlanar and braided proof-nets for multiplicative linear logic with mix
We consider a class of graphs embedded in R2 as noncommutative proof-nets with an explicit exchange rule. We give two characterization of such proof-nets, one representing proof-nets as CW-complexes in a two-dimensional disc, the other extending a characterization by Asperti. As a corollary, we obtain that the test of correctness in the case of planar graphs is linear in the size of the data. B...
متن کامل